The flipping group of a line graph

نویسندگان

  • Hau-wen Huang
  • Chih-wen Weng
چکیده

Let X be a simple connected graph with n vertices and m edges. Every vertex of X is assigned either black state or white state. We move by selecting a vertex v of X having black state and then change the states of all neighbors of v. This is the flipping puzzle on X and it corresponds to a group action. We referred this group to the flipping group of X. In this paper, we are mainly concerned about the flipping group on the line graph L(X) of X. We show that the flipping group of L(X) is isomorphic to a semidirect product of (Z/2Z) and the symmetric group Sn, where k = (n − 1)(m − n + 1) if n is odd; k = (n− 2)(m−n+1) if n is even and Z is the additive group of integers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Line completion number of grid graph Pn × Pm

The concept of super line graph was introduced in the year 1995 by Bagga, Beineke and Varma. Given a graph with at least r edges, the super line graph of index r, Lr(G), has as its vertices the sets of r-edges of G, with two adjacent if there is an edge in one set adjacent to an edge in the other set. The line completion number lc(G) of a graph G is the least positive integer r for which Lr(G) ...

متن کامل

Line graphs associated to the maximal graph

Let $R$ be a commutative ring with identity. Let $G(R)$ denote the maximal graph associated to $R$, i.e., $G(R)$ is a graph with vertices as the elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $R$ containing both. Let $Gamma(R)$ denote the restriction of $G(R)$ to non-unit elements of $R$. In this paper we study the various graphi...

متن کامل

A Novel Molecular Descriptor Derived from Weighted Line Graph

The Bertz indices, derived by counting the number of connecting edges of line graphs of a molecule were used in deriving the QSPR models for the physicochemical properties of alkanes. The inability of these indices to identify the hetero centre in a chemical compound restricted their applications to hydrocarbons only. In the present work, a novel molecular descriptor has been derived from the w...

متن کامل

MORE ON EDGE HYPER WIENER INDEX OF GRAPHS

‎Let G=(V(G),E(G)) be a simple connected graph with vertex set V(G) and edge‎ ‎set E(G)‎. ‎The (first) edge-hyper Wiener index of the graph G is defined as‎: ‎$$WW_{e}(G)=sum_{{f,g}subseteq E(G)}(d_{e}(f,g|G)+d_{e}^{2}(f,g|G))=frac{1}{2}sum_{fin E(G)}(d_{e}(f|G)+d^{2}_{e}(f|G)),$$‎ ‎where de(f,g|G) denotes the distance between the edges f=xy and g=uv in E(G) and de(f|G)=∑g€(G)de(f,g|G). ‎In thi...

متن کامل

The spectrum of the hyper-star graphs and their line graphs

Let n 1 be an integer. The hypercube Qn is the graph whose vertex set isf0;1gn, where two n-tuples are adjacent if they differ in precisely one coordinate. This graph has many applications in Computer sciences and other area of sciences. Inthe graph Qn, the layer Lk is the set of vertices with exactly k 1’s, namely, vertices ofweight k, 1 k n. The hyper-star graph B(n;k) is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008